Semidirect Product with an Order-computable Pseudovariety and Tameness
نویسندگان
چکیده
The semidirect product of pseudovarieties of semigroups with an order-computable pseudovariety is investigated. The essential tool is the natural representation of the corresponding relatively free profinite semigroups and how it transforms implicit signatures. Several results concerning the behavior of the operation with respect to various kinds of tameness properties are obtained as applications.
منابع مشابه
Tameness of The Pseudovariety Ls1
A class of finite semigroups V is said to be decidable if the membership problem for V has a solution, that is, if we can construct an algorithm to test whether a given semigroup lies in V. Decidability of pseudovarieties is not preserved by some of the most common pseudovariety operators, such as semidirect product, Mal’cev product and join [1, 17]. In particular Rhodes [17] has exhibited a de...
متن کاملTameness of pseudovariety joins
The concept of tameness of a pseudovariety was introduced by Almeida and Steinberg [1] as a tool for proving decidability of the membership problem for semidirect products of pseudovarieties. Recall that the join V ∨ W of two pseudovarieties V and W is the least pseudovariety containing both V and W. This talk is concerned with the problem of proving tameness of joins. This problem was consider...
متن کاملHyperdecidable Pseudovarieties and the Calculation of Semidirect Products
This note introduces the notion of a hyperdecidable pseudovariety. This notion appears naturally in trying to prove decidability of the membership problem of semidirect products of pseudovarieties of semigroups. It turns out to be a generalization of a notion introduced by C. J. Ash in connection with his proof of the \type II" theorem. The main results in this paper include a formulation of th...
متن کاملEquations on Semidirect Products of Commutative Semigroups
In this paper; we study equations on semidirect products of commutative semigroups. Let Comq,r denote the pseudovariety of all finite semigroups that satisfy the equations xy = yx and x r + q = xr. The pseudovariety Com1,1 is the pseudovariety of all finite semilattices. We consider the product pseudovariety Comq,r * generated by all semidirect products of the form S*T with S ∈ Comq,r and T ∈ ,...
متن کاملSyntactic and Global Semigroup Theory, a Synthesis Approach
This paper is the culmination of a series of work integrating syntactic and global semigroup theoretical approaches for the purpose of calculating semidirect products of pseudovarieties of semigroups. We introduce various abstract and algorithmic properties that a pseudovariety of semi-groups might possibly satisfy. The main theorem states that given a nite collection of pseudovarieties, each s...
متن کامل